Looking for a Cheaper ROSA

Process Algebras, PAs, are formalisms able to capture the behaviour of a computing system by, for example, giving the labelled transition system, LTS, where states are nodes and where all possible evolutions of the system are arcs; The drawing of the complete LTS is a NP-complete task, so that, the reaching of a particular ‘desired’ state is a problem which deserves some heuristic for improving the amount of resources to be carried out. In this line, Artificial Intelligence by means of Genetic Algorithms (GA’s), provides metaheuristic techniques that have obtained good results in problems in which exhaustive techniques fail due to the size of the search space, as it is the exploration of a LTS. In this paper, we try to avoid this problem, so only unfolding the most promising (for the task of reaching a ‘goal’ state) branches within the